On Safe Tractable Approximations of Chance-Constrained Linear Matrix Inequalities
نویسندگان
چکیده
منابع مشابه
On Safe Tractable Approximations of Chance-Constrained Linear Matrix Inequalities
In the paper we consider the chance-constrained version of an affinely perturbed linear matrix inequality (LMI) constraint, assuming the primitive perturbations to be independent with light-tail distributions (e.g., bounded or Gaussian). Constraints of this type, playing a central role in chance-constrained linear/conic quadratic/semidefinite programming, are typically computationally intractab...
متن کاملOn safe tractable approximations of chance constraints
A natural way to handle optimization problem with data affected by stochastic uncertainty is to pass to a chance constrained version of the problem, where candidate solutions should satisfy the randomly perturbed constraints with probability at least 1− . While being attractive from modeling viewpoint, chance constrained problems “as they are” are, in general, computationally intractable. In th...
متن کاملOn Tractable Approximations of Uncertain Linear Matrix Inequalities Affected by Interval Uncertainty
We present efficiently verifiable sufficient conditions for the validity of specific NPhard semi-infinite systems of linear matrix inequalities (LMIs) arising from LMIs with uncertain data and demonstrate that these conditions are “tight” up to an absolute constant factor. In particular, we prove that given an n × n interval matrix Uρ = {A | |Aij − Aij | ≤ ρCij}, one can build a computable lowe...
متن کاملTractable algorithms for chance-constrained combinatorial problems
This paper aims at proposing tractable algorithms to find effectively good solutions to large size chance-constrained combinatorial problems. A new robust model is introduced to deal with uncertainty in mixed-integer linear problems. It is shown to be strongly related to chance-constrained programming when considering pure 0– 1 problems. Furthermore, its tractability is highlighted. Then, an op...
متن کاملLinear Matrix Inequalities with Stochastically Dependent Perturbations and Applications to Chance-Constrained Semidefinite Optimization
The wide applicability of chance–constrained programming, together with advances in convex optimization and probability theory, has created a surge of interest in finding efficient methods for processing chance constraints in recent years. One of the successes is the development of so–called safe tractable approximations of chance–constrained programs, where a chance constraint is replaced by a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 2009
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.1080.0352